package com.problem.leetcode;

import java.util.Arrays;

/**
 * 解法:使用双指针
 *
 * @author didi
 * @DESCRIPTION
 * @create 2019-04-26 15:04
 **/

public class Problem977 {
    public int[] sortedSquares(int[] A) {
        for (int i = 0; i < A.length; i++) {
            A[i] = A[i] * A[i];
        }
        Arrays.sort(A);
        return A;


    }


}
